A Framework for Building OLAP Cubes on Graphs
نویسندگان
چکیده
Graphs are widespread structures providing a powerful abstraction for modeling networked data. Large and complex graphs have emerged in various domains such as social networks, bioinformatics, and chemical data. However, current warehousing frameworks are not equipped to handle efficiently the multidimensional modeling and analysis of complex graph data. In this paper, we propose a novel framework for building OLAP cubes from graph data and analyzing the graph topological properties. The framework supports the extraction and design of the candidate multidimensional spaces in property graphs. Besides property graphs, a new database model tailored for multidimensional modeling and enabling the exploration of additional candidate multidimensional spaces is introduced. We present novel techniques for OLAP aggregation of the graph, and discuss the case of dimension hierarchies in graphs. Furthermore, the architecture and the implementation of our graph warehousing framework are presented and show the effectiveness of our approach.
منابع مشابه
Graphes enrichis par des Cubes (GreC) : une approche innovante pour l'OLAP sur des réseaux d'information
In order to make the online analysis of information networks, several works combine OLAP and graphs, combination known as Graph OLAP. To complete these works which often offer to analyze cubes of graphs, in a different and complementary way, we propose a new approach called GreC (Graphs enriched by Cubes). Instead of building cubes of graphs, our proposal is to enrich the graphs with cubes, gra...
متن کاملWarehousing RDF Graphs∗
Research in data warehousing (DW) has developed expressive and efficient tools for the multidimensional analysis of large amounts of data. As more data gets produced and shared in RDF, analytic concepts and tools for analyzing such irregular, graph-shaped, semantic-rich data need to be revisited. We introduce the first all-RDF model for warehousing RDF graphs. Notably, we define analytical sche...
متن کاملFrom Analysis to Interactive Exploration: Building Visual Hierarchies from OLAP Cubes
We present a novel framework for comprehensive exploration of OLAP data by means of user-defined dynamic hierarchical visualizations. The multidimensional data model behind the OLAP architecture is particularly suitable for sophisticated analysis of large data volumes. However, the ultimate benefit of applying OLAP technology depends on the ”intelligence” and usability of visual tools available...
متن کاملA note on minimum linear arrangement for BC graphs
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, Z-cubes, etc. as the subfamilies.
متن کاملA Constraint-Based Framework for Computing Privacy Preserving OLAP Aggregations on Data Cubes
A constraint-based framework for computing privacy preserving OLAP aggregations on data cubes is proposed and experimentally assessed in this paper. Our framework introduces a novel privacy OLAP notion, which, following consolidated paradigms of OLAP research, looks at the privacy of aggregate patterns defined on multidimensional ranges rather than the privacy of individual tuples/data-cells, l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015